TOPOLOGY INDEPENDENT SIRS PROCESS
نویسندگان
چکیده
منابع مشابه
Respiratory Motion Compensation with Topology Independent Surrogates
We present a method for organ motion compensation based on a statistical motion model. The novelty of our method is, that the surrogates for prediction can be independent of the model’s topology i.e. the surrogate signal does not have to correspond to a point of the motion model. By non-linear regression, we grasp the correlation between a captured signal during free breathing and the motion mo...
متن کاملTopology-Independent Region Tracking with Level Sets
This paper presents a new approach to the tracking of regions in an image sequence. Unlike most other methods, the proposed approach can handle topology changes, i.e., regions may split or merge. This flexibility is naturally embedded into a partial differential equation that solves a minimum description length (MDL) estimation problem. The basic estimation criterion consists of only two terms:...
متن کاملOMNIX: A Topology-Independent P2P Middleware
Peer-to-Peer (P2P) computing has been increasingly gaining interest. P2P architectures are no longer just used for sharing music files over the Internet. P2P middleware systems attempt to provide an abstraction between the application and the underlying P2P infrastructure by providing higher-level services such as distributed P2P searches and direct communication among peers. Such systems often...
متن کاملComplex Independent Process Analysis
We present a general framework for the search of hidden independent processes in the complex domain. The task is to estimate the hidden independent multidimensional complex-valued components observing only the mixture of the processes driven by them. In our model (i) the hidden independent processes can be multidimensional, they may be subject to (ii) moving averaging, or may evolve in an autor...
متن کاملThe independent neighborhoods process
A triangle T (r) in an r-uniform hypergraph is a set of r + 1 edges such that r of them share a common (r − 1)-set of vertices and the last edge contains the remaining vertex from each of the first r edges. Our main result is that the random greedy triangle-free process on n points terminates in an r-uniform hypergraph with independence number O((n log n)). As a consequence, using recent result...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Contributions, Section of Natural, Mathematical and Biotechnical Sciences
سال: 2017
ISSN: 1857-9949,1857-9027
DOI: 10.20903/csnmbs.masa.2012.33.1-2.32